On counting interval lengths of interval graphs
نویسندگان
چکیده
منابع مشابه
On Cayley's formula for counting trees in nested interval graphs
In this paper it is shown that the spectrum of a nested interval graph has a very simple structure. From this result a formula is derived to the number of spanning trees in a nested interval graph; this is a generalization of the Cayley formula.
متن کاملGossiping on Interval Graphs
We present an algorithm that produces a schedule of transmissions to achieve gossiping in a system where nodes are equipped with radio transceivers; diierent nodes have transceivers with diierent ranges. We assume that all the nodes are placed on a line and that all communication occurs in one dimension. Finally, unlike traditional system models for gossiping, we assume that all nodes within ra...
متن کاملInterval Graph Representation with Given Interval and Intersection Lengths
We consider the problem of finding interval representations of graphs that additionally respect given interval lengths and/or pairwise intersection lengths, which are represented as weight functions on the vertices and edges, respectively. Pe’er and Shamir proved that the problem is NP-complete if only the former are given [SIAM J. Discr. Math. 10.4, 1997]. We give both a linear-time and a logs...
متن کاملOpen - Interval Graphs versus Closed - Interval Grap
A graph G = (V, E) is said to be represented by a family F of nonempty sets if there is a bijection f:V--*F such that uv ~ E if and only iff(u)Nf(v)q=~. It is proved that if G is a countable graph then G can be represented by open intervals on the real line if and only if G can be represented by closed intervals on the real line, however, this is no longer true when G is an uncountable graph. S...
متن کاملInduced Subgraph Isomorphism on Interval and Proper Interval Graphs
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a complete graph the problem is NP-complete, as it is then equivalent to the Clique problem. In a recent paper [10] Marx and Schlotter show that Induced Subgraph Isomorphism is NP-complete when G and H are restricted to b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2010.07.006